package HashBuck;

public class HashBuck2<K,V>{

    class Node<K,V>{
        public K key;
        public V val;
        Node<K,V> next;

        public Node(K key, V val) {
            this.key = key;
            this.val = val;
        }
    }


    public Node<K,V>[] array;
    public int usedSize;
    private static final float DEFAULT_LOAD_FACTOR=0.75f;

    public HashBuck2(){
        array=(Node<K,V>[])new Node[10];
    }

    public void put(K key,V val){
        int hash=key.hashCode();
        int index=hash% array.length;

        Node<K,V> cur=array[index];
        // 首先判断里面是否已经含有，如果有，则更新，没有则头插
        while(cur!=null){
            if(cur.key.equals(key)){
                cur.val=val;
            }
            cur= cur.next;
        }
        Node<K,V> node=new Node(key, val);
        node.next=array[index];
        array[index]=node;
        usedSize++;

    }
    public V get(K key){
        int hash=key.hashCode();
        int index=hash% array.length;
        Node<K,V> cur=array[index];
        while(cur!=null){
            if(cur.key.equals(key)){
                return cur.val;
            }
            cur= cur.next;
        }
        return null;
    }
}
